General Symmetry Breaking Constraints
نویسنده
چکیده
We describe some new propagators for breaking symmetries in constraint satisfaction problems. We also introduce symmetry breaking constraints to deal with symmetries acting simultaneously on variables and values, conditional symmetries, as well as symmeties acting on set and other types of variables.
منابع مشابه
Dynamic Symmetry Breaking Constraints
We present a general method for dynamically posting symmetry breaking constraints during search. The basic idea is very simple. Given any set of symmetry breaking constraints, if during search a symmetry of one of these constraints is entailed and this is consistent with previously posted symmetry breaking constraints, then we post this constraint. We illustrate the method with two examples whe...
متن کاملDynamic Posting of Static Symmetry Breaking Constraints∗
We have proposed a method for dynamically posting symmetry breaking constraints to eliminate value interchangeability [1]. We now extend this method to work with any type of symmetry breaking constraint for any type of symmetry. We prove that this method is correct in general. That is, it only eliminates symmetric solutions. We also identify some simple conditions when it eliminates all symmetr...
متن کاملCombining Symmetry Breaking and Global Constraints
We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a general purpose propagator for this family of constraints, and show how to improve its complexity by exploiting properties of the included global constraints.
متن کاملSymmetry-Breaking Constraints for Matrix Models
Many CSPs can be effectively represented and efficiently solved using matrix models, in which the matrices may have symmetry between their rows and/or columns. Eliminating all such symmetry can be very costly as there are in general exponentially many symmetries. Cost-effective methods have been proposed to break much of the symmetry, if not all. In this paper, we continue with this line of res...
متن کاملEfficient Structural Symmetry Breaking for Constraint Satisfaction Problems
Symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries. In general, these schemes may take exponential space or time to eliminate all the symmetries. We identify several classes of CSPs that encompass many practical problems and for which symmetry breaking for various ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006